import collections
class Solution(object):
    def minSteps(self, s, t):
        c1 = collections.Counter(s)
        c2 = collections.Counter(t)
        ans = 0
        for key in c1:
            ans += max(c1[key] - c2[key], 0)
        return ans
